1

The planar -means problem is NP-hard

Year:
2012
Language:
english
File:
PDF, 282 KB
english, 2012
2

Approximating extent measures of points

Year:
2004
Language:
english
File:
PDF, 343 KB
english, 2004
4

Approximation Algorithms for a k-Line Center

Year:
2005
Language:
english
File:
PDF, 219 KB
english, 2005
7

Facility Location on a Polyhedral Surface

Year:
2003
Language:
english
File:
PDF, 263 KB
english, 2003
17

On Clustering to Minimize the Sum of Radii

Year:
2012
Language:
english
File:
PDF, 223 KB
english, 2012
18

Optimally Decomposing Coverings with Translates of a Convex Polygon

Year:
2011
Language:
english
File:
PDF, 874 KB
english, 2011
20

On Metric Clustering to Minimize the Sum of Radii

Year:
2010
Language:
english
File:
PDF, 492 KB
english, 2010
26

Improved Approximation Algorithms for Geometric Set Cover

Year:
2007
Language:
english
File:
PDF, 238 KB
english, 2007
27

High-Dimensional Shape Fitting in Linear Time

Year:
2004
Language:
english
File:
PDF, 301 KB
english, 2004
29

Efficient Subspace Approximation Algorithms

Year:
2012
Language:
english
File:
PDF, 681 KB
english, 2012
30

Approximating the Radii of Point Sets

Year:
2007
Language:
english
File:
PDF, 192 KB
english, 2007
31

The computation of market equilibria

Year:
2004
Language:
english
File:
PDF, 673 KB
english, 2004
33

Linear approximation of simple objects

Year:
1997
Language:
english
File:
PDF, 647 KB
english, 1997
37

A (1+ε)-approximation algorithm for 2-line-center

Year:
2003
Language:
english
File:
PDF, 263 KB
english, 2003
38

Approximating Shortest Paths on a Nonconvex Polyhedron

Year:
2000
Language:
english
File:
PDF, 264 KB
english, 2000